Search results for "510 Mathematics"

showing 10 items of 27 documents

A posteriori error majorants of the modeling errors for elliptic homogenization problems

2013

In this paper, we derive new two-sided a posteriori estimates of the modeling errors for linear elliptic boundary value problems with periodic coefficients solved by homogenization. Our approach is based on the concept of functional a posteriori error estimation. The estimates are obtained for the energy norm and use solely the global flux of the non-oscillatory solution of the homogenized model and solution of a boundary value problem on the cell of periodicity.

10123 Institute of Mathematics510 MathematicsNorm (mathematics)Mathematical analysista111A priori and a posterioriGeneral MedicineBoundary value problemHomogenization (chemistry)2600 General MathematicsMathematicsComptes Rendus Mathematique
researchProduct

A posteriori modelling-discretization error estimate for elliptic problems with L ∞-Coefficients

2017

We consider elliptic problems with complicated, discontinuous diffusion tensor A0. One of the standard approaches to numerically treat such problems is to simplify the coefficient by some approximation, say Aϵ, and to use standard finite elements. In [19] a combined modelling-discretization strategy has been proposed which estimates the discretization and modelling errors by a posteriori estimates of functional type. This strategy allows to balance these two errors in a problem adapted way. However, the estimate of the modelling error was derived under the assumption that the difference A0 - Aϵ becomes small with respect to the L∞-norm. This implies in particular that interfaces/discontinui…

10123 Institute of Mathematics510 Mathematicselliptic regularity2604 Applied Mathematicsmodel simplification2612 Numerical Analysis2605 Computational Mathematicsa posteriori error estimation
researchProduct

Parallelisierte Faktorisierung mit dem Quadratischen Sieb

2018

510 Mathematics510 Mathematik
researchProduct

Observable radizielle Untergruppen von halbeinfachen algebraischen Gruppen

1979

Sei G eine affine algebraische Gruppe, definiert tiber einem algebraisch abgeschlossenen K6rper k von beliebiger Charakteristik. Die observablen Untergruppen von G sind die Untergruppen, die als Stabilisatoren bei rationalen Darstellungen von G auftreten. Sie wurden in [2] und [5] ausfiihrlich diskutiert. Dabei zeigte sich, dab es im allgemeinen wohl sehr schwierig ist zu entscheiden, ob eine Untergruppe observabel ist. Daher ist es sinnvoll, Kriterien zu finden. In [9] gab Sukhanov ftir Charakteristik 0 ein notwendiges und hinreichendes Kriterium daftir an, dab eine radizielle Untergruppe einer halbeinfachen algebraischen Gruppe observabel ist; dabei will ich unter einer radiziellen Unterg…

510 MathematicsGeneral Mathematics510 MathematikHumanitiesMathematicsMathematische Zeitschrift
researchProduct

Invarianten unipotenter Gruppen

1981

Algebra510 MathematicsGeneral Mathematics510 MathematikMathematics
researchProduct

Sampling methods for low-frequency electromagnetic imaging

2007

For the detection of hidden objects by low-frequency electromagnetic imaging the linear sampling method works remarkably well despite the fact that the rigorous mathematical justification is still incomplete. In this work, we give an explanation for this good performance by showing that in the low-frequency limit the measurement operator fulfils the assumptions for the fully justified variant of the linear sampling method, the so-called factorization method. We also show how the method has to be modified in the physically relevant case of electromagnetic imaging with divergence-free currents. We present numerical results to illustrate our findings, and to show that similar performance can b…

Applied MathematicsMathematical analysis510 MathematikLow frequencyComputer Science ApplicationsTheoretical Computer ScienceOperator (computer programming)510 MathematicsSignal ProcessingFactorization methodLimit (mathematics)AlgorithmMathematical PhysicsMathematics
researchProduct

The factorization method for real elliptic problems

2006

The Factorization Method localizes inclusions inside a body from mea- surements on its surface. Without a priori knowing the physical parameters inside the inclusions, the points belonging to them can be characterized using the range of an auxiliary operator. The method relies on a range characterization that relates the range of the auxiliary operator to the measurements and is only known for very particular applications. In this work we develop a general framework for the method by considering sym- metric and coercive operators between abstract Hilbert spaces. We show that the important range characterization holds if the difference between the inclusions and the background medium satisfi…

Applied MathematicsMathematical analysisHilbert space510 MathematikInverse problemLenstra elliptic curve factorizationSemi-elliptic operatorRange (mathematics)symbols.namesakeOperator (computer programming)510 MathematicsElliptic partial differential equationMetric (mathematics)symbolsAnalysisMathematics
researchProduct

Space of signatures as inverse limits of Carnot groups

2021

We formalize the notion of limit of an inverse system of metric spaces with 1-Lipschitz projections having unbounded fibers. The construction is applied to the sequence of free Carnot groups of fixed rank n and increasing step. In this case, the limit space is in correspondence with the space of signatures of rectifiable paths in ℝn, as introduced by Chen. Hambly-Lyons’s result on the uniqueness of signature implies that this space is a geodesic metric tree. As a particular consequence we deduce that every path in ℝn can be approximated by projections of some geodesics in some Carnot group of rank n, giving an evidence that the complexity of sub-Riemannian geodesics increases with the step.…

Carnot groupsignature of pathsryhmäteoriametric treeinverse limitsub-Riemannian distancedifferentiaaligeometria510 Mathematicspath lifting propertysubmetryMathematics::Metric GeometryMathematics::Differential Geometrymittateoriafree nilpotent groupstokastiset prosessit
researchProduct

Local minimizers and gamma-convergence for nonlocal perimeters in Carnot groups

2020

We prove the local minimality of halfspaces in Carnot groups for a class of nonlocal functionals usually addressed as nonlocal perimeters. Moreover, in a class of Carnot groups in which the De Giorgi's rectifiability Theorem holds, we provide a lower bound for the $\Gamma$-liminf of the rescaled energy in terms of the horizontal perimeter.

Class (set theory)Pure mathematicsControl and OptimizationCarnot groups calibrations nonlocal perimeters/ Γ-convergence sets of finite perimeter rectifiabilityMathematics::Analysis of PDEssets of finite perimetervariaatiolaskentaComputer Science::Computational Geometry01 natural sciencesUpper and lower boundsdifferentiaaligeometriasymbols.namesakeMathematics - Analysis of PDEs510 MathematicsMathematics - Metric GeometryComputer Science::Logic in Computer ScienceConvergence (routing)FOS: MathematicsMathematics::Metric Geometry0101 mathematicscalibrationsMathematicsnonlocal perimeters010102 general mathematicsrectifiabilityryhmäteoriaMetric Geometry (math.MG)matemaattinen optimointi010101 applied mathematicsComputational MathematicsΓ-convergenceΓ-convergenceCarnot groupsControl and Systems EngineeringsymbolsCarnot cycleAnalysis of PDEs (math.AP)ESAIM: Control, Optimisation and Calculus of Variations
researchProduct

Computing Euclidean Steiner trees over segments

2020

In the classical Euclidean Steiner minimum tree (SMT) problem, we are given a set of points in the Euclidean plane and we are supposed to find the minimum length tree that connects all these points, allowing the addition of arbitrary additional points. We investigate the variant of the problem where the input is a set of line segments. We allow these segments to have length 0, i.e., they are points and hence we generalize the classical problem. Furthermore, they are allowed to intersect such that we can model polygonal input. As in the GeoSteiner approach of Juhl et al. (Math Program Comput 10(2):487–532, 2018) for the classical case, we use a two-phase approach where we construct a superse…

Control and OptimizationSelection (relational algebra)0211 other engineering and technologies02 engineering and technologySubset and supersetManagement Science and Operations ResearchSteiner tree problemComputational geometrySet (abstract data type)symbols.namesakeLine segment510 MathematicsEuclidean geometry021108 energyMathematicsDiscrete mathematicsT57-57.97021103 operations researchApplied mathematics. Quantitative methods510 MathematikQA75.5-76.95004 InformatikTree (graph theory)Computational MathematicsExact algorithmModeling and SimulationElectronic computers. Computer sciencesymbols004 Data processing
researchProduct